package com.run.zx;

public class Sort {
	public static void main(String[] args) {
		
	}
	static void shellSort(int R[],int d[],int t) {
		for (int k = 0;k<t; k++) {
			sellInsert(R, d[k]);
		}
		
	}
	static void sellInsert(int R[],int dk) {
		int n=0;
		for (int i = dk+1; i<=n; i++) {
			if(R[i]<R[i-dk]) {
				R[0]=R[i];
				for(int j=i-dk;(j>0)&&(R[0]<R[j]);j=j-dk) {
					R[j+dk]=R[j];
					R[j+dk]=R[0];
				}
			}
		}
	}
}
